Verifying Multran Programs with Temporal Logic

A coordinationstyle programminglanguage, Multran, and its temporal logic semantics are proposed. Multran uses Linda-like tuple space to coordinate concurrent transactions, which could be written in any language as long as they satisfy their preconditions and post-conditions. It has an intuitional presentation and enjoys a temporal logic semantics for program veriication. A Multran program can be executed in a parallel, sequential, or distributed manner based on available resources, and its correctness can be reasoned about by temporal logic. In particular , temporal logic can be used to reason about the safety and liveness properties of Multran programs.